VEDAS: an efficient GPU alternative for store and query of large RDF data sets

نویسندگان

چکیده

Abstract Resource Description Framework (RDF) is commonly used as a standard for data interchange on the web. The collection of RDF sets can form large graph which consumes time to query. It known that modern Graphic Processing Units (GPUs) be employed execute parallel programs in order speedup running time. In this paper, we propose novel representation along with query processing algorithm suitable GPU processing. Since main challenges architecture are limited memory sizes, transfer latency, and vast number cores. Our system designed strengthen use cores reduce effect transfer. We consists indices column-based ID requirement. indexing pre-upload filtering techniques then applied between host memory. add index swapping process facilitate sorting joining based given variable step size results’ storage, experimental results show our about 35% smaller than traditional NT format 40% less compared gStore. ranging from 1.95 397.03 when RDF3X gStore WatDiv test suite. achieves 578.57 62.97 LUBM benchmark RDF-3X analysis shows cases gain benefits approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and Adaptable Query Workload-Aware Management for RDF Data

The Resource Description Framework (RDF) is a flexible model for representing information about resources in the web. With the increasing amount of RDF data which is becoming available, efficient and scalable management of RDF data has become a fundamental challenge to achieve the Semantic Web vision. We present a flexible and adaptable approach for achieving efficient and scalable management o...

متن کامل

Query Processing for RDF Data

The World Wide Web today is a huge network of information resources which was built in order to broadcast information for human users. Consequently, most of the information on the Web is designed to be suitable for human consumption: the structuring principles are weak, many different kinds of information co-exist, and most of the information is represented as free text. With the increasing siz...

متن کامل

Towards SPARQL-Based Induction for Large-Scale RDF Data Sets

We show how to convert OWL Class Expressions to SPARQL queries where the instances of that concept are with a specific ABox equal to the SPARQL query result. Furthermore, we implement and integrate our converter into the CELOE algorithm (Class Expression Learning for Ontology Engineering), where it replaces the position of a traditional OWL reasoner. This will foster the application of structur...

متن کامل

An update strategy for the WaterFowl RDF data store

The WaterFowl RDF Store is characterized by its high compression rate and a self-indexing approach. Both of these characteristics are due to its underlying architecture. Intuitively, it is based on a stack composed of two forms of Succinct Data Structures, namely bitmaps and wavelet trees. The ability to efficiently retrieve information from these structures is performed via a set of operations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Big Data

سال: 2021

ISSN: ['2196-1115']

DOI: https://doi.org/10.1186/s40537-021-00513-y